On the computational complexity of Nash equilibria for (0, 1) bimatrix gamesCODENOTTI, Bruno; STEFANKOVIC, Daniel.Information processing letters. 2005, Vol 94, Num 3, pp 145-150, issn 0020-0190, 6 p.Article

Solvability of graph inequalitiesSCHAEFER, Marcus; STEFANKOVIC, Daniel.SIAM journal on discrete mathematics (Print). 2006, Vol 19, Num 3, pp 728-743, issn 0895-4801, 16 p.Article

REMOVING INDEPENDENTLY EVEN CROSSINGSPELSMAJER, Michael J; SCHAEFER, Marcus; STEFANKOVIC, Daniel et al.SIAM journal on discrete mathematics (Print). 2011, Vol 24, Num 2, pp 379-393, issn 0895-4801, 15 p.Article

Spiraling and Folding: The Word ViewSCHAEFER, Marcus; SEDGWICK, Eric; STEFANKOVIC, Daniel et al.Algorithmica. 2011, Vol 60, Num 3, pp 609-626, issn 0178-4617, 18 p.Article

Locally testable cyclic codesBABAI, Laszlo; SHPILKA, Amir; STEFANKOVIC, Daniel et al.IEEE transactions on information theory. 2005, Vol 51, Num 8, pp 2849-2858, issn 0018-9448, 10 p.Article

The Complexity of Counting Eulerian Tours in 4-regular GraphsQI GE; STEFANKOVIC, Daniel.Algorithmica. 2012, Vol 63, Num 3, pp 588-601, issn 0178-4617, 14 p.Article

Adaptive Simulated Annealing: A Near-Optimal Connection between Sampling and CountingSTEFANKOVIC, Daniel; VEMPALA, Santosh; VIGODA, Eric et al.Journal of the Association for Computing Machinery. 2009, Vol 56, Num 3, issn 0004-5411, 18:1-18:36Article

Negative Examples for Sequential Importance Sampling of Binary Contingency TablesBEZAKOVA, Ivona; SINCLAIR, Alistair; STEFANKOVIC, Daniel et al.Algorithmica. 2012, Vol 64, Num 4, pp 606-620, issn 0178-4617, 15 p.Article

Efficient deadlock-free multidimensional interval routing in hypercube-like networksKRALOVIC, Rastislav; ROVAN, Branislav; RUZICKA, Peter et al.Computing and informatics. 2002, Vol 21, Num 3, pp 265-287, issn 1335-9150, 23 p.Article

Crossing Numbers of Graphs with Rotation SystemsPELSMAJER, Michael J; SCHAEFER, Marcus; STEFANKOVIC, Daniel et al.Algorithmica. 2011, Vol 60, Num 3, pp 679-702, issn 0178-4617, 24 p.Article

ACCELERATING SIMULATED ANNEALING FOR THE PERMANENT AND COMBINATORIAL COUNTING PROBLEMSBEZAKOVA, Ivona; STEFANKOVIC, Daniel; VAZIRANI, Vijay V et al.SIAM journal on computing (Print). 2008, Vol 37, Num 5, pp 1429-1454, issn 0097-5397, 26 p.Article

Negative examples for sequential importance sampling of binary contingency tablesBEZAKOVA, Ivona; SINCLAIR, Alistair; STEFANKOVIC, Daniel et al.Lecture notes in computer science. 2006, pp 136-147, issn 0302-9743, isbn 3-540-38875-3, 1Vol, 12 p.Conference Paper

Algorithms for normal curves and surfacesSCHAEFER, Marcus; SEDGWICK, Eric; STEFANKOVIC, Daniel et al.Lecture notes in computer science. 2002, pp 370-380, issn 0302-9743, isbn 3-540-43996-X, 11 p.Conference Paper

Train tracks and confluent drawingsHUI, Peter; PELSMAJER, Michael J; SCHAEFER, Marcus et al.Algorithmica. 2007, Vol 47, Num 4, pp 465-479, issn 0178-4617, 15 p.Article

Odd crossing number is not crossing numberPELSMAJER, Michael J; SCHAEFER, Marcus; STEFANKOVIC, Daniel et al.Lecture notes in computer science. 2006, pp 386-396, issn 0302-9743, isbn 3-540-31425-3, 1Vol, 11 p.Conference Paper